On the isotropic constant of random polytopes
نویسندگان
چکیده
Let X1, . . . , XN be independent random vectors uniformly distributed on an isotropic convex body K ⊂ Rn, and let KN be the symmetric convex hull of Xi’s. We show that with high probability LKN ≤ C √ log(2N/n), where C is an absolute constant. This result closes the gap in known estimates in the range Cn ≤ N ≤ n1+δ. Furthermore, we extend our estimates to the symmetric convex hulls of vectors y1X1, . . . , yNXN , where y = (y1, . . . , yN ) is a vector in RN . Finally, we discuss the case of a random vector y. 2010 Classification: Primary 52A23, 46B06; Secondary: 52A22, 52B11, 60D05
منابع مشابه
On Mean Outer Radii of Random Polytopes
In this paper we introduce a new sequence of quantities for random polytopes. Let KN = conv{X1, . . . ,XN} be a random polytope generated by independent random vectors uniformly distributed in an isotropic convex body K of R. We prove that the so-called k-th mean outer radius R̃k(KN ) has order max{ √ k, √ logN}LK with high probability if n ≤ N ≤ e √ . We also show that this is also the right or...
متن کاملStochastic Analysis of Seepage through Natural Alluvial Deposits Considering Mechanical Anisotropy
The soil is a heterogeneous and anisotropic medium. Hydraulic conductivity, an intrinsic property of natural alluvial deposits varies both deterministically and randomly in space and has different values in various directions. In the present study, the permeability of natural deposits and its influence on the seepage flow through a natural alluvial deposit is studied. The 2D Finite Difference c...
متن کاملEstimating Support Functions of Random Polytopes via Orlicz Norms
We study the expected value of support functions of random polytopes in a certain direction, where the random polytope is given by independent random vectors uniformly distributed in an isotropic convex body. All results are obtained by an utterly novel approach, using probabilistic estimates in connection with Orlicz norms that were not used in this connection before.
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014